Modal Operators for Coequations
نویسنده
چکیده
We present the dual to Birkhoff’s variety theorem in terms of predicates over the carrier of a cofree coalgebra (i.e., in terms of “coequations”). We then discuss the dual to Birkhoff’s completeness theorem, showing how closure under deductive rules dualizes to yield two modal operators acting on coequations. We discuss the properties of these operators and show, given a familiar condition on the endofunctor, the two operators commute, and we prove as main result the invariance theorem, which is the formal dual of Birkhoff’s completeness theorem.
منابع مشابه
Modal Predicates and Co-equations
We show how coalgebras can be presented by operations and equations. This is a special case of Linton’s approach to algebras over a general base category X , namely where X is taken as the dual of sets. Since the resulting equations generalise coalgebraic coequations to situations without cofree coalgebras, we call them coequations. We prove a general co-Birkhoff theorem describing covarieties ...
متن کاملOn the Diagram of One Type Modal Operators on Intuitionistic fuzzy sets: Last expanding with $Z_{alpha ,beta }^{omega ,theta
Intuitionistic Fuzzy Modal Operator was defined by Atanassov in cite{at3}in 1999. In 2001, cite{at4}, he introduced the generalization of thesemodal operators. After this study, in 2004, Dencheva cite{dencheva} definedsecond extension of these operators. In 2006, the third extension of thesewas defined in cite{at6} by Atanassov. In 2007,cite{gc1}, the authorintroduced a new operator over Intuit...
متن کاملThe operators over the GIFS
In this paper, newly defined level operators and modal-like operators over extensional generalized intuitionistic fuzzy sets (GIFSB) are proposed. Some of the basic properties of the new operators are discussed.
متن کاملRegular Varieties of Automata and Coequations
In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Llópez, and Rutten to characterize nonempty classes of deterministic automata that are closed under products, subautomata, homomorphic images, and sums. One characterization is as classes of automata defined by regular equations and the second one is as classes of automata ...
متن کاملDuality of Equations and Coequations via Contravariant Adjunctions
In this paper we show duality results between categories of equations and categories of coequations. These dualities are obtained as restrictions of dualities between categories of algebras and coalgebras, which arise by lifting contravariant adjunctions on the base categories. By extending this approach to (co)algebras for (co)monads, we retrieve the duality between equations and coequations f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 44 شماره
صفحات -
تاریخ انتشار 2001